An E cient Recovery - Based Spin Lock Protocol
نویسندگان
چکیده
منابع مشابه
cient Locking for Shared Memory Database Systems 1
Signi cant performance advantages can be realized by implementing a database system on a shared memory multiprocessor. An e cient implementation of a lock manager is a prerequisite for e cient transaction processing in multiprocessor database systems. To this end, we advocate adopting an autonomous locking strategy. In autonomous locking, transactions acquire and release locks via operations on...
متن کاملPer Processor Spin-Lock Priority for Partitioned Multiprocessor Real-Time Systems
Two traditional approaches exist for a task that is blocked on a global resource; a task either performs a non-preemptive busy wait, i.e., spins, or suspends and releases the processor. Previously, we have shown that both approaches can be viewed as spinning either at the highest priority (HP) or at the lowest priority on the processor (LP), respectively. Based on this view, previously we have ...
متن کاملIntelligent Memory : An Architecture forLock - Free Synchronization
This paper presents intelligent memory, a new memory architecture capable of providing e cient lock-free synchronization. In the intelligent memory, a sequence of operations on a shared object associated with that memory module can be processed without any intervention so that an environment for the synchronization can be provided by executing a critical section itself in that memory module. Fo...
متن کاملSpin lock and magnetization transfer imaging of head and neck tumors.
PURPOSE To evaluate and compare the spin lock and magnetization transfer techniques in the differentiation of benign and malignant head and neck tumors at magnetic resonance (MR) imaging. MATERIALS AND METHODS Forty consecutive patients with histologically verified head and neck tumors (20 malignant and 20 benign tumors, including five infections) were studied with a 0.1-T MR unit. The spin l...
متن کاملSend Message into a Definite Future
Rivest et al proposed a time-lock puzzle scheme for encrypting messages which can only be decrypted in the future. Such a puzzle speci es an algorithm for decrypting the message locked in and the speci ed algorithm has a well understood time complexity. However, that time-lock puzzle scheme does not provide a means for one to examine whether a puzzle has been formed in good order. Consequently,...
متن کامل